Equilibrium analysis for a mass-conserving model in presence of cavitation

We study the existence of equilibrium positions for the load problem in Lubrication Theory. The problem consists of two surfaces in relative motion separated by a small distance filled by a lubricant. The system is described by the modified Reynolds equation (Elrod–Adams model) which describes the behavior of the lubricant and an extra integral equation given the balance of forces. The balance of forces allows to obtain the unknown position of the surfaces, defined with one degree of freedom.     

On Controllability And Maximum Principle for Discrete Inclusions ∗ ∗A part of the paper was written while the first author was visiting the laboratory of Prof.S.Suzuki,Department of Mechanical Engineering,Sophia University,Tokyo,Japan$ef:

The paper develops sufficient conditions for controllability and necessary conditions in different forms of the maximum principle for extremal solutions of discrete inclusions. The objective function is assumed to be locally lipschitzian only     

Combining GPS carrier phase and Doppler observations for precise velocity determination

The truncation error and propagation error are analyzed for velocity determination through differential GPS carrier phase observations,and an approach for the choice of the best number of points for the central difference method is developed.In order to overcome the disadvantages of existing GPS velocity determination methods,a new velocity determination algorithm is presented,based on combining carrier phase and Doppler observations.The basic idea is that two types of observation are combined by adding the...     

Composite Likelihood Inference in a Discrete Latent Variable Model for Two-Way “Clustering-by-Segmentation” Problems

We consider a discrete latent variable model for two-way data arrays, which allows one to simultaneously produce clusters along one of the data dimensions (e.g., exchangeable observational units or features) and contiguous groups, or segments, along the other (e.g., consecutively ordered times or locations). The model relies on a hidden Markov structure but, given its complexity, cannot be estimated by full maximum likelihood. Therefore, we introduce a composite likelihood methodology based on considering different subsets of the data. The proposed approach is illustrated by simulation, and with an application to genomic data.     

Computationally Efficient Changepoint Detection for a Range of Penalties

In the multiple changepoint setting, various search methods have been proposed, which involve optimizing either a constrained or penalized cost function over possible numbers and locations of changepoints using dynamic programming. Recent work in the penalized optimization setting has focused on developing an exact pruning-based approach that, under certain conditions, is linear in the number of data points. Such an approach naturally requires the specification of a penalty to avoid under/over-fitting. Work has been undertaken to identify the appropriate penalty choice for data-generating processes with known distributional form, but in many applications the model assumed for the data is not correct and these penalty choices are not always appropriate. To this end, we present a method that enables us to find the solution path for all choices of penalty values across a continuous range. This permits an evaluation of the various segmentations to identify a suitable penalty choice. The computational complexity of this approach can be linear in the number of data points and linear in the difference between the number of changepoints in the optimal segmentations for the smallest and largest penalty values. Supplementary materials for this article are available online.     

One-Step Generalized Estimating Equations With Large Cluster Sizes

Medical studies increasingly involve a large sample of independent clusters, where the cluster sizes are also large. Our motivating example from the 2010 Nationwide Inpatient Sample (NIS) has 8,001,068 patients and 1049 clusters, with average cluster size of 7627. Consistent parameter estimates can be obtained naively assuming independence, which are inefficient when the intra-cluster correlation (ICC) is high. Efficient generalized estimating equations (GEE) incorporate the ICC and sum all pairs of observations within a cluster when estimating the ICC. For the 2010 NIS, there are 92.6 billion pairs of observations, making summation of pairs computationally prohibitive. We propose a one-step GEE estimator that (1) matches the asymptotic efficiency of the fully iterated GEE; (2) uses a simpler formula to estimate the ICC that avoids summing over all pairs; and (3) completely avoids matrix multiplications and inversions. These three features make the proposed estimator much less computationally intensive, especially with large cluster sizes. A unique contribution of this article is that it expresses the GEE estimating equations incorporating the ICC as a simple sum of vectors and scalars.     

Bayesian Estimation for the Order of INAR(q) Mo del

In this paper, we consider the problem of determining the order of INAR(q) model on the basis of the Bayesian estimation theory. The Bayesian es-timator for the order is given with respect to a squared-error loss function. The consistency of the estimator is discussed. The results of a simulation study for the estimation method are presented.     

Maximum likelihood estimation for second level fMRI data analysis with expectation trust region algorithm

The trust region method which originated from the Levenberg–Marquardt (LM) algorithm for mixed effect model estimation are considered in the context of second level functional magnetic resonance imaging (fMRI) data analysis. We first present the mathematical and optimization details of the method for the mixed effect model analysis, then we compare the proposed methods with the conventional expectation-maximization (EM) algorithm based on a series of datasets (synthetic and real human fMRI datasets). From simulation studies, we found a higher damping factor for the LM algorithm is better than lower damping factor for the fMRI data analysis. More importantly, in most cases, the expectation trust region algorithm is superior to the EM algorithm in terms of accuracy if the random effect variance is large. We also compare these algorithms on real human datasets which comprise repeated measures of fMRI in phased-encoded and random block experiment designs. We observed that the proposed method is faster in computation and robust to Gaussian noise for the fMRI analysis. The advantages and limitations of the suggested methods are discussed.     

Comparison of scale factor estimators for ultrasonic temperature monitoring: Application to structural health monitoring

In Structural Health Monitoring (SHM) of materials, estimating the effects of environmental and operational conditions such as temperature is important. Indeed, temperature changes induce modifications of the mechanical properties of the material and therefore cause a dilation of the acoustic signals characterized by a scale factor. This paper described four scale factor estimators able to monitor changes in temperature: The short-time cross-correlation (STXC) method, the stretching method (STRE), the Minimum Variance Based Estimator method (MVBE) and the Scale Transform Based Estimator method (STBE). The first two methods have already been assessed in the literature while the latter two have been specifically developed for this study. First, closed-form for the Cramer-Rao bound on the estimates of the scale factor, from a simplified deterministic signal, are derived and simplified expressions are given. Then, a statistical evaluation of the quality of estimates is conducted through Monte-Carlo simulations using synthetic signals, based on a model taking into account the influence of temperature. A raw estimate of the computational complexity of signal processing methods also completes this evaluation phase. Finally, the experimental validation of estimation methods is conducted on an aluminum plate subjected to temperatures variations in a controlled thermal environment. The temperature estimates are then faced with an analytical model describing the material behavior.     

Local Sensitivity Analysis in Estimation Problems

This article deals with the problem of local sensitivity analysis, that is, how sensitive are the results of a statistical analysis to changes in the data? A general methodology of sensitivity analysis is applied to some statistical problems. The proposed methods are applicable to any statistical problem that can be expressed as an optimization problem or that involves solving a system of equations. As some particular examples, the methodology is applied to the maximum likelihood method, the standard and constrained methods of moments and the standard and constrained probability weighted moments methods. Unlike the standard method of moments, the constrained method of moments ensures that the obtained estimates are always consistent with the data. Closed analytical formulas for the calculation of these local sensitivities are derived. The obtained sensitivities include: (a) the objective function sensitivities to data points and (b) the sensitivities of the estimated parameters to data points. The derived formulas for the sensitivities are based on recent results in the area of mathematical programming. Several examples of parameter estimation problems are used to illustrate the methodology.